A Rapid Numerical Algorithm to Compute Matrix Inversion
نویسنده
چکیده
The aim of the present work is to suggest and establish a numerical algorithm based on matrix multiplications for computing approximate inverses. It is shown theoretically that the scheme possesses seventh-order convergence, and thus it rapidly converges. Some discussions on the choice of the initial value to preserve the convergence rate are given, and it is also shown in numerical examples that the proposed scheme can easily be taken into account to provide robust preconditioners.
منابع مشابه
A stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملبهبود روش انتگرال‌گیری دقیق مرتبه اول برای تحلیل دینامیکی سازه‌ها با معکوس‌سازی ماتریس حالت
For solving the dynamic equilibrium equation of structures, several second-order numerical methods have so far been proposed. In these algorithms, conditional stability, period elongation, amplitude error, appearance of spurious frequencies and dependency of the algorithms to the time steps are the crucial problems. Among the numerical methods, Newmark average acceleration algorithm, regardl...
متن کاملEfficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
This article deals with the efficient (approximate) inversion of finite element stiffness matrices of general second-order elliptic operators with L∞-coefficients. It will be shown that the inverse stiffness matrix can be approximated by hierarchical matrices (H-matrices). Furthermore, numerical results will demonstrate that it is possible to compute an approximate inverse with almost linear co...
متن کاملNumerical inversion of Laplace transform via wavelet in ordinary differential equations
This paper presents a rational Haar wavelet operational method for solving the inverse Laplace transform problem and improves inherent errors from irrational Haar wavelet. The approach is thus straightforward, rather simple and suitable for computer programming. We define that $P$ is the operational matrix for integration of the orthogonal Haar wavelet. Simultaneously, simplify the formulaes of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012